Given a straight-line drawing $\Gamma$ of a graph $G=(V,E)$, for every vertex$v$ the ply disk $D_v$ is defined as a disk centered at $v$ where the radius ofthe disk is half the length of the longest edge incident to $v$. The ply numberof a given drawing is defined as the maximum number of overlapping disks atsome point in $\mathbb{R}^2$. Here we present a tool to explore and evaluatethe ply number for graphs with instant visual feedback for the user. Weevaluate our methods in comparison to an existing ply computation by De Luca etal. [WALCOM'17]. We are able to reduce the computation time from seconds tomilliseconds for given drawings and thereby contribute to further research onthe ply topic by providing an efficient tool to examine graphs extensively byuser interaction as well as some automatic features to reduce the ply number.
展开▼
机译：给定图$ G =（V，E）$的直线绘图$ \ Gamma $，对于每个顶点$ v $，层板盘$ D_v $被定义为以$ v $为中心的盘，其中盘的半径是$ v $的最长边沿长度的一半。给定工程图的层数定义为$ \ mathbb {R} ^ 2 $中某个点处重叠磁盘的最大数量。在这里，我们提供了一种工具，可通过用户即时的视觉反馈来探索和评估图表的层数。与De Luca等人现有的层计算相比，我们对我们的方法进行了评估。 [WALCOM'17]。对于给定的图纸，我们能够将计算时间从几秒钟缩短到几毫秒，从而通过提供一种有效的工具来通过用户交互广泛地检查图形以及一些自动功能来减少层数，从而有助于对层的主题进行进一步的研究。
展开▼
